Top-k Searching for More Users in Multidimensional B-tree with Lists
نویسنده
چکیده
In the last few years, research of top-k processing is in progress in various domains. The aim of our research is efficient top-k searching of the best k objects with more attributes according to complex user preferences. We use a model of user preferences based on fuzzy functions. In our previous research we focus on top-k searching in tree-oriented data structures and we developed various top-k algorithms, which solve top-k problem efficiently and support the model of user preferences. Furthermore, we assume that attributes of an object type can be distributed in various information resources. Therefore, integration of data is one of the topics of our research. We are developing a software system that will be including our new-developed technologies and experiments with real data from various information resources.
منابع مشابه
Extending Fagin's Algorithm for More Users Based on Multidimensional B-Tree
We discuss the issue of searching the best K objects in more attributes for more users. Every user prefers objects in different ways. User preferences are modelled locally with a fuzzy function and globally with an aggregation function. Also, we discuss the issue of searching the best K objects without accessing all objects. We deal with the use of local preferences when computing Fagin’s algor...
متن کاملA Novel Hybrid Approach for Email Spam Detection based on Scatter Search Algorithm and K-Nearest Neighbors
Because cyberspace and Internet predominate in the life of users, in addition to business opportunities and time reductions, threats like information theft, penetration into systems, etc. are included in the field of hardware and software. Security is the top priority to prevent a cyber-attack that users should initially be detecting the type of attacks because virtual environments are not moni...
متن کاملA comparative study of multiple attribute tree and inverted file structures for large bibliographic files
A variety of data structures such as inverted file, multi-lists, quad tree, k-d tree. range tree. polygon tree, quintary tree. multidimensional tries, segment tree. doubly chained tree. the grid file. d-fold tree, super B-tree, Multiple .4ttribute Tree (MAT). etc. have been studied for multidimensional searching and related problems. Physical data base organization, which is an important applic...
متن کاملCombination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences
In this article we focus on efficient solving of searching the best K objects in more attributes according to user’s preferences. Local preferences are modelled with one of four types of fuzzy function. Global preferences are modelled concurrently with an aggregation function. We focused on searching the best K objects according to various user’s preferences without accessing all objects. There...
متن کاملSpace-efficient Data Structures for String Searching and Retrieval
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii Chapter 1: Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 The Models of Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Our Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کامل